Near-Optimal Dispersion on Arbitrary Anonymous Graphs
نویسندگان
چکیده
Given an undirected, anonymous, port-labeled graph of $n$ memory-less nodes, $m$ edges, and degree $\Delta$, we consider the problem dispersing $k\leq n$ robots (or tokens) positioned initially arbitrarily on one or more nodes to exactly $k$ different graph, each node. The objective is simultaneously minimize time achieve dispersion memory requirement at robot. If all are a single node, depth first search (DFS) traversal solves this in $O(\min\{m,k\Delta\})$ with $\Theta(\log(k+\Delta))$ bits However, if multiple best previously known algorithm $O(\min\{m,k\Delta\}\cdot \log \ell)$ storing robot, where $\ell\leq k/2$ number multiplicity initial configuration. In paper, present novel multi-source DFS solving improving bound by $O(\log matching asymptotically single-source bounds. This for that optimal both arbitrary anonymous graphs constant degree, $\Delta=O(1)$. Furthermore, result holds synchronous asynchronous settings.
منابع مشابه
Optimal Total Exchange in Anonymous Cayley Graphs
Total exchange or all-to-all personalized communication problem is that each node in a network has a message to be sent to every other node. To solve this communication problem, we present a time-optima algorithm in anonymous Cayley graphs as assuming a single-port full duplex model in which every node is able to send and receive at most one message in each time unit.
متن کاملNear-Optimal Placement of Secrets in Graphs
We consider the reconstruction of shared secrets in communication networks, which are modelled by graphs whose components are subject to possible failure. The reconstruction probability can be approximated using minimal cuts, if the failure probabilities of vertices and edges are close to zero. As the main contribution of this paper, node separators are used to design a heuristic for the near-o...
متن کاملNear-Optimal Separators in String Graphs
Let G be a string graph (an intersection graph of continuous arcs in the plane) with m edges. Fox and Pach proved that G has a separator consisting of O(m √ logm) vertices, and they conjectured that the bound of O( √ m) actually holds. We obtain separators with O( √ m logm) vertices. Let G = (V,E) be a graph with n vertices. A separator in G is a set S ⊆ V of vertices such that there is a parti...
متن کاملNear-Optimal Induced Universal Graphs for Bounded Degree Graphs
A graph U is an induced universal graph for a family F of graphs if every graph in F is a vertex-induced subgraph of U . For the family of all undirected graphs on n vertices Alstrup, Kaplan, Thorup, and Zwick [STOC 2015] give an induced universal graph with O ( 2n/2 ) vertices, matching a lower bound by Moon [Proc. of Glasgow Math. Association 1965]. Let k = dD/2e. Improving asymptotically on ...
متن کاملNear-Optimal Bounds for Binary Embeddings of Arbitrary Sets
We study embedding a subset K of the unit sphere to the Hamming cube {−1,+1}m . We characterize the tradeoff between distortion and sample complexity m in terms of the Gaussian width ω(K) of the set. For subspaces and several structured-sparse sets we show that Gaussian maps provide the optimal tradeoff m ∼ δω(K), in particular for δ distortion one needs m ≈ δd where d is the subspace dimension...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Science Research Network
سال: 2022
ISSN: ['1556-5068']
DOI: https://doi.org/10.2139/ssrn.4282040